Sharp bounds on the zeroth-order general Randić index of trees in terms of domination number
نویسندگان
چکیده
<abstract><p>The zeroth-order general Randić index of graph $ G = (V_G, E_G) $, denoted by ^0R_{\alpha}(G) is the sum items (d_{v})^{\alpha} over all vertices v\in V_G where \alpha a pertinently chosen real number. In this paper, we obtain sharp upper and lower bounds on ^0R_{\alpha} trees with given domination number \gamma for \alpha\in(-\infty, 0)\cup(1, \infty) \alpha\in(0, 1) respectively. The corresponding extremal graphs these are also characterized.</p></abstract>
منابع مشابه
A note on the zeroth-order general randić index of cacti and polyomino chains
The present note is devoted to establish some extremal results for the zeroth-order general Randi'{c} index of cacti, characterize the extremal polyomino chains with respect to the aforementioned index, and hence to generalize two already reported results.
متن کاملa note on the zeroth-order general randić index of cacti and polyomino chains
the present note is devoted to establish some extremal results for the zeroth-order general randi'{c} index of cacti, characterize the extremal polyomino chains with respect to the aforementioned index, and hence to generalize two already reported results.
متن کاملBounds on the restrained Roman domination number of a graph
A {em Roman dominating function} on a graph $G$ is a function$f:V(G)rightarrow {0,1,2}$ satisfying the condition that everyvertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex$v$ for which $f(v) =2$. {color{blue}A {em restrained Roman dominating}function} $f$ is a {color{blue} Roman dominating function if the vertices with label 0 inducea subgraph with no isolated vertex.} The wei...
متن کاملon the first extended zeroth-order connectivity index of trees
the first extended zeroth-order connectivity index of a graph g is defined as 0 1/2 1 ( ) ( ) , v v v g g d where v (g) is the vertex set of g, and v d is the sum of degrees of neighbors of vertex v in g. we give a sharp lower bound for the first extended zeroth-order connectivity index of trees with given numbers of vertices and pendant vertices,...
متن کاملOuter independent Roman domination number of trees
A Roman dominating function (RDF) on a graph G=(V,E) is a function f : V → {0, 1, 2} such that every vertex u for which f(u)=0 is adjacent to at least one vertex v for which f(v)=2. An RDF f is calledan outer independent Roman dominating function (OIRDF) if the set ofvertices assigned a 0 under f is an independent set. The weight of anOIRDF is the sum of its function values over ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AIMS mathematics
سال: 2021
ISSN: ['2473-6988']
DOI: https://doi.org/10.3934/math.2022142